Guessing Facets: Polytope Structure and Improved LP Decoding

نویسندگان

  • Alexandros G. Dimakis
  • Amin A. Gohari
  • Martin J. Wainwright
چکیده

In this paper we investigate the structure of the fundamental polytope used in the Linear Programming decoding introduced by Feldman, Karger and Wainwright. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We further exploit these geometrical properties to devise an improved decoding algorithm with the same complexity order as LP decoding that provably performs better, for any blocklength. It proceeds by guessing facets of the polytope, and then resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that the proposed algorithm, when applied to suitable expander codes, succeeds unless there exist a certain number of pseudocodewords, all adjacent to the ML codeword on the LP decoding polytope, and with higher likelihood than the ML codeword. We then describe an extended algorithm, still with polynomial complexity, that succeeds as long as there are at most polynomially many pseudocodewords above the ML codeword.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometric Approach to Graph Isomorphism

We present an integer linear program (IP), for the Graph Isomorphism (GI) problem, which has non-empty feasible solution if and only if the input pair of graphs are isomorphic. We study the polytope of the convex hull of the solution points of IP, denoted by B. Exponentially many facets of this polytope are known. We show that in case of non-isomorphic pairs of graphs if a feasible solution exi...

متن کامل

Hardware-Based Linear Program Decoding with the Alternating Direction Method of Multipliers

We present a hardware-based implementation of Linear Program (LP) decoding for binary linear codes. LP decoding frames error-correction as an optimization problem. In contrast, variants of Belief Propagation (BP) decoding frame error-correction as a problem of graphical inference. LP decoding has several advantages over BP-based methods, including convergence guarantees and better error-rate pe...

متن کامل

On the Mean Number of Facets of a Gaussian Polytope

A Gaussian polytope is the convex hull of normally distributed random points in a Euclidean space. We give an improved error bound for the expected number of facets of a Gaussian polytope when the dimension of the space is fixed and the number of points tends to infinity. The proof applies the theory of the asymptotic distribution of the top order statistic of a collection of independently dist...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Symmetric Quadratic Semi-Assignment Polytope

We deal with quadratic semi-assignment problems with symmetric distances. This symmetry reduces the number of variables in its mixed integer programming formulation. We investigate a polytope arising from the problem, and obtain some basic polyhedral properties, the dimension, the affine hull and certain facets through an isomorphic projection. We also present a nontrivial class of facets. Comp...

متن کامل

Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory

Linear programming (LP) decoding of low-density parity-check codes was introduced by Feldman et al. in [1]. In his formulation it is assumed that communication takes place over a memoryless channel and that the source is uniform. Here, we extend the LP decoding paradigm by studying its application to scenarios with source nonuniformity and to decoding over channels with memory. We develop two d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0709.3915  شماره 

صفحات  -

تاریخ انتشار 2006